Counting and packing Hamilton $\ell$-cycles in dense hypergraphs
نویسندگان
چکیده
منابع مشابه
Counting and packing Hamilton `-cycles in dense hypergraphs
A k-uniform hypergraph H contains a Hamilton `-cycle, if there is a cyclic ordering of the vertices of H such that the edges of the cycle are segments of length k in this ordering and any two consecutive edges fi, fi+1 share exactly ` vertices. We consider problems about packing and counting Hamilton `-cycles in hypergraphs of large minimum degree. Given a hypergraph H, for a d-subset A ⊆ V (H)...
متن کاملPacking Tight Hamilton Cycles in Uniform Hypergraphs
We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We define a class of ( , p)-regular hypergraphs, that includes random hypergraph...
متن کاملPacking hamilton cycles in random and pseudo-random hypergraphs
We say that a k-uniform hypergraph C is a Hamilton cycle of type `, for some 1 ≤ ` ≤ k, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices and for every pair of consecutive edges Ei−1, Ei in C (in the natural ordering of the edges) we have |Ei−1 \ Ei| = `. We prove that for k/2 < ` ≤ k, with high probability almost all edges of the ran...
متن کاملCounting and packing Hamilton cycles in dense graphs and oriented graphs
We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several extremal results. In particular, we show that every nearly cn-regular oriented graph on n vertices with c > 3/8 contains (cn/e)(1 + o(1)) directed Hamilton cycles. This is an extension of a result of Cuckler, who settle...
متن کاملPacking, Counting and Covering Hamilton cycles in random directed graphs
A Hamilton cycle in a digraph is a cycle passes through all the vertices, where all the arcs are oriented in the same direction. The problem of finding Hamilton cycles in directed graphs is well studied and is known to be hard. One of the main reasons for this, is that there is no general tool for finding Hamilton cycles in directed graphs comparable to the so called Posá ‘rotationextension’ te...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorics
سال: 2016
ISSN: 2156-3527,2150-959X
DOI: 10.4310/joc.2016.v7.n1.a6